Dynamic Capacity Acquisition and Assignment under Uncertainty

نویسندگان

  • Shabbir Ahmed
  • Renan Garcia
چکیده

Given a set of m resources and n tasks, the dynamic capacity acquisition and assignment problem seeks a minimum cost schedule of capacity acquisitions for the resources and the assignment of resources to tasks, over a given planning horizon of T periods. This problem arises, for example, in the integrated planning of locations and capacities of distribution centers (DCs), and the assignment of customers to the DCs, in supply chain applications. We consider the dynamic capacity acquisition and assignment problem in an environment where the assignment costs and the processing requirements for the tasks are uncertain. Using a scenario based approach, we develop a stochastic integer programming model for this problem. The highly non-convex nature of this model prevents the application of standard stochastic programming decomposition algorithms. We use a recently developed decomposition based branch-andbound strategy for the problem. Encouraging preliminary computational results are provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Benders’ decomposition algorithm to solve bi-level bi-objective scheduling of aircrafts and gate assignment under uncertainty

Management and scheduling of flights and assignment of gates to aircraft play a significant role to improve the performance of the airport, due to the growing number of flights and decreasing the flight times. This research addresses the assignement and scheduling problem of runways and gates simultaneously. Moreover, this research is the first study that considers the constraint of unavailabil...

متن کامل

Performance Analysis of Dynamic and Static Facility Layouts in a Stochastic Environment

In this paper, to cope with the stochastic dynamic (or multi-period) problem, two new quadratic assignment-based mathematical models corresponding to the dynamic and static approaches are developed. The product demands are presumed to be dependent uncertain variables with normal distribution having known expectation, variance, and covariance that change from one period to the next one, randomly...

متن کامل

Robust Dynamic Traffic Assignment under Demand and Capacity Uncertainty

In this note we discuss the system optimum dynamic traffic assignment (SO-DTA) problem in the presence of time-dependent uncertainty on the demands and link capacities. We start from the deterministic linear programming formulation of the SO-DTA problem introduced by Ziliaskopoulos in [14], and then consider a robust version of the decision problem where the total travel time must be minimized ...

متن کامل

Joint optimization of pricing and capacity allocation for two competitive airlines under demand uncertainty

Nowadays, airline industries should overcome different barriers regarding the fierce competition and changing consumer behavior. Thus, they attempt to focus on joint decision making which enables them to set pricing and capacity allocation to maximize their profits. In this research, we develop a model to optimize pricing and capacity allocation in a duopoly of single-flight leg for two competi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Annals OR

دوره 124  شماره 

صفحات  -

تاریخ انتشار 2003